Topological Interference Management With Confidential Messages

The topological interference management (TIM) problem refers to the study of $K$ -user partially connected networks with no channel state information at transmitters (CSIT), except for knowledge network topology. In this paper, we TIM confidential messages (TIM-CM), where message confidentiality must be satisfied in addition reliability constraints. particular, each transmitted decodable its intended receiver and remain remaining notation="LaTeX">$(K-1)$ receivers. Our main contribution is present a comprehensive set results TIM-CM by studying symmetric secure degrees freedom (SDoF). To end, first characterize necessary sufficient conditions feasibility positive SDoF any arbitrary We next two achievable schemes problem: For scheme, use concept partition and, second one, independent sets. also outer bounds on Using these bounds, optimal all notation="LaTeX">$K=2$ notation="LaTeX">$K=3$ topologies.